Avyaya Analyzer: Analysis of Indeclinables using Finite State Transducers
نویسنده
چکیده
In Sanskrit, avyaya i.e., the indeclinable, plays an important role in the construction of a sentence and can be used as preposition, interjection, particle, conjunction or an adverb. To understand a given sentence, a thorough cognizance of the avyaya is necessary. This paper briefly describes the avyayas, types of avyayas and role of avyayas. An avyaya analysis tool (avyaya Morphological Analyzer) has been described here in using FST. The system described in this paper reads the input and produces the derivational morphological information. This paper portrays a simple and straight forward technique to analyze the avyayas. General Terms Natural Language Processing (NLP) – Morphological Analyzer
منابع مشابه
A Morphological Analyzer For Wolof Using Finite-State Techniques
This paper reports on the design and implementation of a morphological analyzer for Wolof. The main motivation for this work is to obtain a linguistically motivated tool using finite-state techniques. The finite-state technology is especially attractive in dealing with human language morphologies. Finite-state transducers (FST) are fast, efficient and can be fully reversible, enabling users to ...
متن کاملAmazighe Verbal Inflectional Morphology: A New Approach for Analysis and Generation
Amazighe inflectional morphology poses special challenges to Natural Language Processing (NLP) systems. Its rich morphology and the highly complex word formation process of roots and patterns make NLP tools for Amazighe very challenging. In this paper we present an approach for inflectional morphological analysis and generation for Amazighe verbs. The main motivation for this work is to obtain ...
متن کاملWeighted Finite-State Morphological Analysis of Finnish Inflection and Compounding
Finnish has a very productive compounding and a rich inflectional system, which causes ambiguity in the morphological segmentation of compounds made with finite state transducer methods. In order to disambiguate the compound segmentations, we compare three different strategies, which we cast in a probabilistic framework. We present a method for implementing the probabilistic framework as part o...
متن کاملAutomatic Sanskrit Segmentizer Using Finite State Transducers
In this paper, we propose a novel method for automatic segmentation of a Sanskrit string into different words. The input for our segmentizer is a Sanskrit string either encoded as a Unicode string or as a Roman transliterated string and the output is a set of possible splits with weights associated with each of them. We followed two different approaches to segment a Sanskrit text using sandhi1 ...
متن کاملA finite-state morphological analyzer for a Lakota precision grammar
This paper reports on the design and implementation of a morphophonological analyzer for Lakota, a member of the Siouan language family. The initial motivation for this work was to support development of a precision implemented grammar for Lakota on the basis of the LinGO Grammar Matrix. A finite-state transducer (FST) was developed to adapt Lakota’s complex verbal morphology into a form direct...
متن کامل